Multi-Objective Russian Doll Search
نویسندگان
چکیده
Russian Doll Search (RDS) is a well-known algorithm for combinatorial optimization. In this paper we extend it from mono-objective to multi-objective optimization. We demonstrate its practical applicability in the challenging multipleorbit SPOT5 instances. Besides being much more efficient than any other alternatives, multi-objective RDS can solve an instance which could not have been solved previously.
منابع مشابه
Search Space Reduction and Russian Doll Search
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation between the objective and problem variables. In this paper, we propose a different modeling and search strategy which focuses on the cost function. We show that by constructing a dual model on the objective variables,...
متن کاملSpecializing Russian Doll Search
Russian Doll Search (RDS) is a clever procedure to solve overconstrained problems. RDS solves a sequence of nested subprob-lems, where two consecutive subproblems diier in one variable only. We present the Specialized RDS (SRDS) algorithm, which solves the current subproblem for each value of the new variable with respect to the previous subproblem. The SRDS lower bound is superior to the RDS l...
متن کاملRussian doll search algorithms for discrete optimization problems
OF DOCTORAL DISSERTATION AALTO UNIVERSITY SCHOOL OF SCIENCE AND TECHNOLOGY P.O. BOX 11000, FI-00076 AALTO http://www.aalto.fi Author Name of the dissertation Manuscript submitted 1.2.2010 Manuscript revised 5.10.2010 Date of the defence 19.11.2010 Article dissertation (summary + original articles) Monograph Faculty Department Field of research Opponent(s) Supervisor Instructor Abstract
متن کاملTagSNP selection using Weighted CSP and Russian Doll Search with Tree Decomposition
The TagSNP problem is a specific form of compression problem arising in genetics. Given a very large set of SNP (genomic positions where polymorphism is observed in a given population), the aim is to select a smallest subset of SNPs which represents the complete set of tagSNP reliably. This is possible because strong correlations existing between neighboring SNPs. Typically, besides minimizing ...
متن کاملA Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph
Finding the clique of maximum cardinality in an arbitrary graph is an NP-Hard problem that has many applications, which has motivated several approaches to solve it exactly despite its difficulty. In this paper, we propose an exact algorithm for the maximum clique problem based on the Russian Dolls Search method. In comparison to a first implementation of this Russian Dolls method from the lite...
متن کامل